/**
 * @file fiboPrint.c
 * @author liuzhilai (you@domain.com)
 * @brief 打印输出fibonacci数列的前20项和
 * f[n]=f[n-1]+f[n-2]
 * @version 0.1
 * @date 2022-11-06
 * 
 * @copyright Copyright (c) 2022
 * 
 */
#include <stdio.h>
int main(){
    //声明数组
    int fibo[20];
    // 声明循环变量
    int i;
    //对数组的初始化
    fibo[0]=1;
    fibo[1]=1;
    //按照fibonacci数列的规则，循环赋值
    for(i=2;i<20;i++){
        fibo[i] = fibo[i-1] + fibo[i-2];
        printf("%d ",fibo[i]);
    }

    return 0;
}